Unbounded quantum graphs with unbounded boundary conditions
نویسندگان
چکیده
منابع مشابه
Transparent Boundary Conditions for Wave Propagation on Unbounded Domains
The numerical solution of the time dependent wave equation in an unbounded domain generally leads to a truncation of this domain, which requires the introduction of an artificial boundary with associated boundary conditions. Such nonreflecting conditions ensure the equivalence between the solution of the original problem in the unbounded region and the solution inside the artificial boundary. W...
متن کاملQuantum Circuits with Unbounded Fan-out
We demonstrate that the unbounded fan-out gate is very powerful. Constant-depth polynomial-size quantum circuits with bounded fan-in and unbounded fan-out over a fixed basis (denoted by QNCf ) can approximate with polynomially small error the following gates: parity, mod[q], And, Or, majority, threshold[t], exact[q], and counting. Classically, we need logarithmic depth even if we can use unboun...
متن کاملUnbounded-Error Quantum Query Complexity
This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Moreover, we ...
متن کاملVariational Approach to Scattering by Unbounded Rough Surfaces with Neumann and Generalized Impedance Boundary Conditions∗
This paper is concerned with problems of scattering of time-harmonic electromagnetic and acoustic waves from an infinite penetrable medium with a finite height modeled by the Helmholtz equation. On the lower boundary of the rough layer, the Neumann or generalized impedance boundary condition is imposed. The scattered field in the unbounded homogeneous medium is required to satisfy the upward an...
متن کاملDirected VR-Representable Graphs have Unbounded Dimension
Visibility representations of graphs map vertices to sets in Euclidean space and express edges as visibility relations between these sets. A three-dimensional visibility representation that has been studied is one in which each vertex of the graph maps to a closed rectangle in R 3 and edges are expressed by vertical visibility between rectangles. The rectangles representing vertices are disjoin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Nachrichten
سال: 2014
ISSN: 0025-584X
DOI: 10.1002/mana.201200135